Model checking propositional dynamic logic with all extras
نویسندگان
چکیده
منابع مشابه
Model checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context-free programs. The algorithm shows that the model checking problem for PDL remains PTIME-complete in the presence of all these operators, in contrast to the high increase in complexity that they cause for the satisfia...
متن کاملEncodings of Bounded LTL Model Checking in Effectively Propositional Logic
In this short paper we describe an encoding of LTL bounded model checking within the Bernays-Schönfinkel fragment of first-order logic. This fragment allows a natural and succinct representation of both a software/hardware system and a property to verify. More interestingly, we note that modules in systems can be directly encoded without a preliminary flattening stage which, in standard approac...
متن کاملProbabilistic Model Checking on Propositional Projection Temporal Logic
Propositional Projection Temporal Logic (PPTL) is a useful formalism for reasoning about period of time in hardware and software systems and can handle both sequential and parallel compositions. In this paper, based on discrete time Markov chains, we investigate the probabilistic model checking approach for PPTL towards verifying arbitrary linear-time properties. We first define a normal form g...
متن کاملProbabilistic Model Checking for Propositional Projection Temporal Logic
Propositional Projection Temporal Logic (PPTL) is a useful formalism for reasoning about period of time in hardware and software systems and can handle both sequential and parallel compositions. In this paper, based on discrete time Markov chains, we investigate the probabilistic model checking approach for PPTL towards verifying arbitrary linear-time properties. We first define a normal form g...
متن کاملGeneralizing Propositional Dynamic Logic
A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions. This yields a logic more general than PDL since new program operations such as angelic choice become expr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2006
ISSN: 1570-8683
DOI: 10.1016/j.jal.2005.08.002